Pseudospectral Mesh Refinement Algorithm Based on Density Function and Its Application
نویسندگان
چکیده
منابع مشابه
Adaptive Mesh Refinement and its Application to Magneto-Hydrodynamics
In this paper we present three improvements over the BergerColella’s adaptive mesh refinement (AMR) approach: adaptive clustering algorithm, conservative prolongation and restriction for cylindrical and spherical grid, and divergence-free reconstruction for AMR.
متن کاملMesh Refinement Using Density Function for Solving Optimal Control Problems
This paper presents a general mesh refinement method based on a density function for distributing the grid points, which can be used for solving optimal control problems through a direct method. The algorithm captures any discontinuities and smoothness irregularities in the state and control variables with high resolution, thus helping with the convergence of the overall optimization algorithm....
متن کاملcompactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولA new adaptive local mesh refinement algorithm and its application on fourth order thin film flow problem
A new adaptive local mesh refinement method is presented for thin film flow problems containing moving contact lines. Based on adaptation on an optimal interpolation error estimate in the L norm (1 < p 61) [L. Chen, P. Sun, J. Xu, Multilevel homotopic adaptive finite element methods for convection dominated problems, in: Domain Decomposition Methods in Science and Engineering, Lecture Notes in ...
متن کاملA Grid-based Clustering Algorithm using Adaptive Mesh Refinement
Clustering analysis, an automatic process to find similar groups of objects from a database, has been studied for many years. With the increasing data size generated recently, clustering large databases poses a challenging task that must satisfy both the requirements of the computation efficiency and result quality. Among the existing clustering algorithms, grid-based algorithms generally have ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Dynamical Systems and Control
سال: 2017
ISSN: 2325-677X,2325-6761
DOI: 10.12677/dsc.2017.62005